Instances of Diagrammatic Reasoning
نویسنده
چکیده
According to Peirce a great part of mathematical thinking consists in observing or imagining the outcomes and regularities of manipulations of all sorts of diagrams. This tenet is explicated and substantiated by expounding the notion of diagram and by analyzing several specific cases from different parts of mathematics.
منابع مشابه
Diagrammatic Reasoning: Route Planning on Maps with ACT-R
Diagrammatic Reasoning Diagrammatic reasoning, reasoning from graphical representations rather than from word-based representations, is pervasive in our society. Computers allow us to easily design and transmit diagrams that encapsulate a variety of information. Maps are specific instances of diagrams that are used to provide current and projected information (Chandrasekaran et al., 2002); for ...
متن کاملPerceptual and Action Routines in Diagrammatic Reasoning for Entity-reidentification
The Objective Force requirements of responsiveness, agility and versatility call for digitized graphical decision support interfaces that automate or otherwise help in various reasoning tasks, including reasoning with visual and diagrammatic representations that are ubiquitous in Army situation understanding, planning and plan monitoring. In earlier papers, we described a diagrammatic reasoning...
متن کاملVisualizing and Specifying Ontologies using Diagrammatic Logics
This paper proposes a diagrammatic logic that is suitable for specifying ontologies. We take a case study style approach to presenting the diagrammatic logic, and draw contrast with RDF graphs and description logics. We provide specifications of two ontologies and show how to depict instances. Diagrammatic reasoning is used to show that an instance conforms to a specification. We also include e...
متن کاملA Proposed Diagrammatic Logic for Ontology Specification and Visualization
We propose a diagrammatic logic that is suitable for specifying ontologies. We provide a specification of a simple ontology and include examples to show how to place constraints on ontology specifications and define queries. The framework also allows the depiction of instances, multiple ontologies to be related, and reasoning about ontologies.
متن کاملOn Automating Diagrammatic Proofs of Arithmetic Arguments
Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which humans can prove by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is often more clearly perceived in these proofs than in the corresponding algebraic proofs; they capture an intuitive notion of truthfulness that humans find easy to...
متن کامل